Generators of pseudo random sequences of galois
نویسندگان
چکیده
منابع مشابه
Galois Rings and Pseudo-random Sequences
We survey our constructions of pseudo random sequences (binary, Z8, Z2l ,. . . ) from Galois rings. Techniques include a local Weil bound for character sums, and several kinds of Fourier transform. Applications range from cryptography ( boolean functions, key generation), to communications (multi-code CDMA), to signal processing (PAPR reduction).
متن کاملPseudo-Random Number Generators
The first option here is not easy. Some pieces of data of this kind exist, for example from the decay of radioactive elements, but generally generation is slow and you cannot get the quantity of random numbers you require for modern applications. The second option here is what I’ll talk about today. Algorithms of this type are called “PseudoRandom Number Generators” (PRNGs). Many bad algorithms...
متن کاملPseudo-Industrial Random SAT Generators
Recent advances in SAT are focused on efficiently solving real-world or industrial problems. However, the reduced number of industrial SAT instances and the high cost of solving them condition the development and debugging processes of new techniques. This problem can be solved by defining new models of random SAT instance that capture realistically the main features of the real-world SAT insta...
متن کاملEntropy of pseudo-random-number generators.
Since the work of Phys. Rev. Lett. 69, 3382 (1992)]] some pseudo-random-number generators are known to yield wrong results in cluster Monte Carlo simulations. In this contribution the fundamental mechanism behind this failure is discussed. Almost all random-number generators calculate a new pseudo-random-number x(i) from preceding values, x(i) =f( x(i-1), x(i-2), ..., x(i-q) ). Failure of these...
متن کاملClass of Trustworthy Pseudo-Random Number Generators
With the widespread use of communication technologies, cryptosystems are therefore critical to guarantee security over open networks as the Internet. Pseudo-random number generators (PRNGs) are fundamental in cryptosystems and information hiding schemes. One of the existing chaos-based PRNGs is using chaotic iterations schemes. In prior literature, the iterate function is just the vectorial boo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics and Control Systems
سال: 2014
ISSN: 1990-5548
DOI: 10.18372/1990-5548.42.8827